Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
111	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: www.iwr.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
112	Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11. Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 03:40:34 Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science
113	Publications Daniel Merkle Submitted [FFM+ 13] Fagerberg, R., C. Flamm, D. Merkle, P. Peters and P.F. Stadler: On the Complexity of Reconstructing Chemical Reaction Networkssubmitted. Books [BM11] Blum, C. and D. Add to Reading List Source URL: www.imada.sdu.dk Language: English - Date: 2013-09-06 03:51:46 Evolution Academia Cybernetics Aquatic ecology Behavior Swarm behaviour Zoology Ant colony optimization algorithms Evolutionary computation Lecture Notes in Computer Science Swarm intelligence Algorithmic Number Theory Symposium
114	Networks embedded in Lorentzian spaces James Clough, Tim Evans Centre for Complexity Science, Imperial College London, London, SW7 2AZ, U.K. {james.clough09,t.evans}@imperial.ac.uk Embedding the nodes of a network in a s Add to Reading List Source URL: www.monmeetings.org Language: English - Date: 2015-09-04 10:24:55 Mathematics Physics Theoretical physics Order theory Lorentzian manifolds Quantum gravity Exact solutions in general relativity Causal sets Minkowski space Metric tensor Spatial network Space
115	ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P
116	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-05-19 04:29:26 Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz
117	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-04-18 04:16:48 Mathematics Search algorithms Information retrieval Information science Hashing Analysis of algorithms Cryptographic hash functions Computational complexity theory Universal hashing Hash function Randomized algorithm Subset sum problem
118	Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:57 Computational complexity theory Theory of computation Analysis of algorithms Operations research Scheduling Algorithm Mathematical logic Theoretical computer science Time complexity NC Job shop scheduling
119	Cryptographic Protocols Spring 2015 Slides for Chapter1 (part 2) Definition of zero-knowledge (ZK) Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-03-06 05:37:28 Cryptography Computing Computational complexity theory Proof of knowledge IP Distribution Challengeresponse authentication Communications protocol ZK Zero-knowledge proof
120	MASON: A New Multi-Agent Simulation Toolkit Sean Luke, Claudio Cioffi-Revilla, Liviu Panait, and Keith Sullivan Department of Computer Science and Center for Social Complexity George Mason University 4400 University Driv Add to Reading List Source URL: cs.gmu.edu Language: English - Date: 2005-02-21 13:23:31 Multi-agent systems Artificial life Simulation Scientific modeling Academia Systems science Computing Complex systems theory Agent-based model Social simulation MASON Swarm behaviour

UPDATE